Primal-Dual Algorithms for Total Variation Based Image Restoration under Poisson Noise Dedicated to Professor Lin Qun on the Occasion of his 80th Birthday
نویسندگان
چکیده
We consider the problem of restoring images corrupted by Poisson noise. Under the framework of maximum a posteriori estimator, the problem can be converted into a minimization problem where the objective function is composed of a Kullback-Leibler (KL)-divergence term for the Poisson noise and a total variation (TV) regularization term. Due to the logarithm function in the KL-divergence term, the non-differentiability of TV term and the positivity constraint on the images, it is not easy to design stable and efficiency algorithm for the problem. Recently, many researchers proposed to solve the problem by Alternating Direction Method of Multipliers (ADMM). Since the approach introduces some auxiliary variables and requires the solution of some linear systems, the iterative procedure can be complicated. Here we formulate the problem as two new constrained minimax problems and solved them by Chambolle-Pock’s first order primal-dual approach. The convergence of our approach is guaranteed by their theory. Comparing with ADMM approaches, our approach requires about half of the auxiliary variables and is matrix-inversion free. Numerical results show that our proposed algorithms are efficient and outperform the ADMM approach.
منابع مشابه
1.5-Q-superlinear convergence of an exterior-point method for constrained optimization Dedicated to Professor Gil Strang on the occasion on his 70th birthday
We introduce and analyze an exterior-point method (epm) for constrained optimization problems with both inequality constraints and equations. We show that under the standard second-order optimality conditions the epm converges to the primal-dual solution with 1.5-Q-superlinear rate.
متن کاملHenson Graphs and Urysohn-henson Graphs as Cayley Graphs Dedicated to Professor Anatoly Vershik on the Occasion of His 80th Birthday
We discuss groups acting regularly on the Henson graphs Γn, answering a question posed by Peter Cameron, and we explore a number of related questions.
متن کاملConvergence analysis of primal-dual algorithms for total variation image restoration
Recently, some attractive primal-dual algorithms have been proposed for solving a saddle-point problem, with particular applications in the area of total variation (TV) image restoration. This paper focuses on the convergence analysis of existing primal-dual algorithms and shows that the involved parameters of those primal-dual algorithms (including the step sizes) can be significantly enlarged...
متن کاملCoincidence Rotations of the Root Lattice a 4 Dedicated to Ludwig Danzer on the Occasion of His 80th Birthday
The coincidence site lattices of the root lattice A4 are considered, and the statistics of the corresponding coincidence rotations according to their indices is expressed in terms of a Dirichlet series generating function. This is possible via an embedding of A4 into the icosian ring with its rich arithmetic structure, which recently [6] led to the classification of the similar sublattices of A...
متن کاملImage Restoration by Variable Splitting based on Total Variant Regularizer
The aim of image restoration is to obtain a higher quality desired image from a degraded image. In this strategy, an image inpainting method fills the degraded or lost area of the image by appropriate information. This is performed in such a way so that the obtained image is undistinguishable for a casual person who is unfamiliar with the original image. In this paper, different images are degr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015